Weak Connectivity in (Un)bounded Dependency Constructions

نویسنده

  • Yong-Beom Kim
چکیده

This paper argues that various kinds of displaced structures in English should be licensed by a more explicitly formulated type of rule schema in order to deal with what is called weak connectivity in English. This paper claims that the filler and the gap site cannot maintain the total identity of features but a partial overlap since the two positions need to obey the structural forces that come from occupying respective positions. One such case is the missing object construction where the subject fillers and the object gaps are to observe requirements that are imposed on the respective positions. Others include passive constructions and topicalized structures. In this paper, it is argued that the feature discrepancy comes from the different syntactic positions in which the fillers are assumed to be located before and after displacement. In order to capture this type of mismatch, syntactically relevant features are handled separately from the semantically motivated features in order to deal with the syntactically imposed requirements.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On bounded weak approximate identities and a new version of them

In this paper, we give a short survey of results and problems concerning the notion of bounded weak approximate identities in Banach algebras. Also, we introduce a new version of approximate identities and give one illuminating example to show the difference.

متن کامل

Grammars for Local and Long Dependencies

Polarized dependency (PD-) grammars are proposed as a means of efficient treatment of discontinuous constructions. PD-grammars describe two kinds of dependencies : local, explicitly derived by the rules, and long, implicitly specified by negative and positive valencies of words. If in a PD-grammar the number of non-saturated valencies in derived structures is bounded by a constant, then it is w...

متن کامل

On the Distribution of the Number of Roots of Polynomials and Explicit Logspace Extractors

Weak designs were defined in [10] and are used in constructions of extractors. Roughly speaking, a weak design is a collection of subsets satisfying some near-disjointness properties. Constructions of weak designs with certain parameters are given in [10]. These constructions are explicit in the sense that they require time and space polynomial in the number of subsets. However, the constructio...

متن کامل

Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation

The notion of treewidth, introduced by Robertson and Seymour in their seminal Graph Minors series, turned out to have tremendous impact on graph algorithmics. Many hard computational problems on graphs turn out to be efficiently solvable in graphs of bounded treewidth: graphs that can be sweeped with separators of bounded size. These efficient algorithms usually follow the dynamic programming p...

متن کامل

Representation of Weak Limits and Definition of Nonconservative Products

The goal of this article is to show that the notion of generalized graphs is able to represent the limit points of the sequence {g(un) dun} in the weak-⋆ topology of measures when {un} is a sequence of continuous functions of uniformly bounded variation. The representation theorem induces a natural definition for the nonconservative product g(u) du in a BV context. Several existing definitions ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007